Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization
نویسندگان
چکیده
منابع مشابه
Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization
Given a permutation π of {1, . . . , n} and a positive integer k, can π be partitioned into at most k subsequences, each of which is either increasing or decreasing? We give an algorithm with running time 2 2 log n that solves this problem, thereby showing that it is fixed parameter tractable. This NP-complete problem is equivalent to deciding whether the cochromatic number of a given permutati...
متن کاملFixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2 2 log n that decides whether π can be partitioned into at most k increasing or decreasing subsequences. Thus we resolve affirmatively the open question of whether the problem is fixed parameter tractable. This NP-complete problem is equivalent to deciding whether the cochromatic number, pa...
متن کاملApproximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems
In the weighted rectangle stabbing problem we are given a grid in ]R2 consisting of columns and rows each having a positive integral weight, and a set of closed axis-parallel rectangles each having a positive integral demand. The rectangles are placed arbitrarily in the grid with the only assumption that each rectangle is intersected by at least one column and at least one row. The objective is...
متن کاملApproximation Algorithms for Capacitated Rectangle Stabbing
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines that intersect all the rectangles. In this paper we study the capacitated version of this problem in which the input includes an integral capacity for each line. The capacity of a line bounds the number of rectangles ...
متن کاملFixed-parameter tractability and lower bounds for stabbing problems
We study the following general stabbing problem from a parameterized complexity point of view: Given a set S of n translates of an object in R, find a set of k lines with the property that every object in S is ”stabbed” (intersected) by at least one line. We show that when S consists of axis-parallel unit squares in R the (decision) problem of stabbing S with axis-parallel lines is W[1]-hard wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2013
ISSN: 0890-5401
DOI: 10.1016/j.ic.2013.08.007